Fast two-step layer-based method for computer generated hologram using sub-sparse 2D fast Fourier transform
نویسندگان
چکیده
منابع مشابه
Sparse 2D Fast Fourier Transform
This paper extends the concepts of the Sparse Fast Fourier Transform (sFFT) Algorithm introduced in [1] to work with two dimensional (2D) data. The 2D algorithm requires several generalizations to multiple key concepts of the 1D sparse Fourier transform algorithm. Furthermore, several parameters needed in the algorithm are optimized for the reconstruction of sparse image spectra. This paper add...
متن کاملSampled fourier transform hologram generated by computer.
A technique to determine a real nonnegative function representing the transmittance of a synthesized hologram is described. The technique uses the positions of the samples in the synthesized hologram to record the phase information of a complex wavefront. Synthesized holograms are displayed on a flying spot scanner and recorded on film. The transmittance of the synthesized hologram is quantized...
متن کاملFast computation of computer-generated hologram using Xeon Phi coprocessor
We report fast computation of computer-generated holograms (CGHs) using Xeon Phi coprocessors, which have massively x86-based processors on one chip, recently released by Intel. CGHs can generate arbitrary light wavefronts, and therefore, are promising technology for many applications: for example, three-dimensional displays, diffractive optical elements, and the generation of arbitrary beams. ...
متن کاملFast and Efficient Sparse 2D Discrete Fourier Transform using Sparse-Graph Codes
We present a novel algorithm, named the 2D-FFAST 1, to compute a sparse 2D-Discrete Fourier Transform (2D-DFT) featuring both low sample complexity and low computational complexity. The proposed algorithm is based on mixed concepts from signal processing (sub-sampling and aliasing), coding theory (sparse-graph codes) and number theory (Chinese-remainder-theorem) and generalizes the 1D-FFAST 2 a...
متن کاملPruning fast Fourier transform algorithm design using group-based method
In this paper, we propose the grouped scheme, which can be specially applied to compute the pruning fast Fourier transform (pruning FFT) with power-of-two partial transformation length. The group-based pruning FFT algorithm applies the scheme of the grouped frequency indices to accelerate computations of selected discrete Fourier transform (DFT) outputs. The proposed pruning FFT algorithm has f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2018
ISSN: 1094-4087
DOI: 10.1364/oe.26.017487